Polygon Clipping and Polygon Reconstruction
نویسندگان
چکیده
Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against each edge of the clipping window, usually a rectangle. As a result, new edges may be added, and existing edges may be discarded, retained, or divided. Multiple polygons may result from clipping a single polygon. After clipping, we may have a set of segments, which must be handled to generate the clipped polygon. This work proposes two new algorithms: clipping polygon against a rectangle window, and polygon reconstruction from a set of segments. The algorithms were implemented in Secondo, a platform for implementing and experimenting with various kinds of data models.
منابع مشابه
An Extension Of Weiler-Atherton Algorithm To Cope With The Self-intersecting Polygon
ABSTRACT: In this paper a new algorithm has been proposed which can fix the problem of WeilerAtherton algorithm. The problem of Weiler-Atherton algorithm lies in clipping self-intersecting polygon. Clipping self-intersecting polygon is not considered in Weiler-Atherton algorithm and hence it is also a main disadvantage of this algorithm. In our new algorithm a self-intersecting polygon has been...
متن کاملExact Illumination in Polygonal Environments using Vertex Tracing
Methods for exact computation of irradiance and form factors associated with polygonal objects have ultimately relied on a formula for a differential area to polygon form factor attributed to Lambert. This paper presents an alternative, an analytical expression based on vertex behavior rather than the edges the polygon. Using this formulation, irradiance values in a scene consisting of partiall...
متن کاملAccelerating Polygon Clipping
Polygon clipping is a central part of image generation and image visualization systems. In spite of its algorithmic simplicity it consumes a considerable amount of hardware or software resources. Polygon clipping performance is dominated by two processes: intersection calculations and data transfers. The paper analyzes the prevalent Sutherland-Hodgman algorithm for polygon clipping and identifi...
متن کاملExperiments on Parallel Polygon Triangulation Using Ear Clipping
We present an experimental study of different strategies for triangulating polygons in parallel. As usual, we call three consecutive vertices of a polygon an ear if the triangle that is spanned by them is completely inside of the polygon. Extensive tests on thousands of sample polygons indicate that most polygons have a linear number of ears. This experimental result suggests that polygon-trian...
متن کاملA Simple and Efficient Algorithm for Line and Polygon Clipping in 2-D Computer Graphics
The most popular lines clipping algorithms are Cohen-Sutherland and Liang-Barsky line clipping algorithm. These algorithms are complex and the steps of calculation are very high. This paper proposes a simple new line clipping algorithm for 2D space which uses the parametric equation of the line. This algorithm further easily extended to the polygon clipping by considering the edge of the polygo...
متن کامل